VisSAT: Visualization of SAT Solver Internals for Computer Aided Hardware Verification

نویسندگان

  • Robert Wille
  • André Sülflow
  • Rolf Drechsler
چکیده

Today, many applications for formal circuit verification exist that rely on solvers for Boolean satisfiability (SAT). Usually, these applications use the SAT solver as a black-box. However, exploiting information on the internals of the solving process can speed-up the treatment of the verification task. In this paper, we present the tool VisSAT. VisSAT provides insights into the internals of SAT solvers. Statistics of the internal solving process are collected and visualized on the circuit. By this, a verification engineer gets insight about potential bottlenecks for formal verification. This can be used to reconfigure the SAT solver or to improve the

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hardware Acceleration for Boolean Satisfiability Solver by Applying Belief Propagation Algorithm

Boolean satisfiability (SAT) has an extensive application domain in computer science, especially in electronic design automation applications. Circuit synthesis, optimization, and verification problems can be solved by transforming original problems to SAT problems. However, the SAT problem is known as an NP-complete problem, which means there is no efficient method to solve SAT problems. There...

متن کامل

zChaff: Modifications and Extensions

The application of SAT solver in industrial verificationtools is mandatory for the successful analysis of prob-lems derived from hardware design, e.g. CombinationalEquivalence Checking (CEC) and Bounded Model Check-ing (BMC). In [8] Chaff, a new powerful SAT solver, waspresented that outperforms most of the existing publiclyavailable SAT solvers when applied to hard ...

متن کامل

Perceptron Learning of SAT

Boolean satisfiability (SAT) as a canonical NP-complete decision problem is one of the most important problems in computer science. In practice, real-world SAT sentences are drawn from a distribution that may result in efficient algorithms for their solution. Such SAT instances are likely to have shared characteristics and substructures. This work approaches the exploration of a family of SAT s...

متن کامل

Accelerating Boolean Satissability with Conngurable Hardware

This paper describes and evaluates methods for implementing formula-speciic Boolean satissability (SAT) solver circuits in conngurable hardware. Starting from a general template design, our approach automatically generates VHDL for a circuit that is speciic to the particular Boolean formula being solved. Such an approach tightly customizes the circuit to a particular problem instance. Thus, it ...

متن کامل

Understanding and Improving a Modern SAT Solver

Propositional satisfiability (SAT) is an NP-complete problem, holding a central place in computer science and engineering. SAT has numerous applications in formal verification, artificial intelligence and other areas. Modern SAT solvers, using an enhanced version of the backtrack search DavisLogemann-Loveland (DLL) algorithm, are able to successfully cope with instances comprising millions of v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011